全文获取类型
收费全文 | 15692篇 |
免费 | 2702篇 |
国内免费 | 2393篇 |
专业分类
电工技术 | 784篇 |
技术理论 | 4篇 |
综合类 | 1162篇 |
化学工业 | 294篇 |
金属工艺 | 141篇 |
机械仪表 | 671篇 |
建筑科学 | 321篇 |
矿业工程 | 221篇 |
能源动力 | 160篇 |
轻工业 | 123篇 |
水利工程 | 250篇 |
石油天然气 | 138篇 |
武器工业 | 143篇 |
无线电 | 3278篇 |
一般工业技术 | 714篇 |
冶金工业 | 73篇 |
原子能技术 | 54篇 |
自动化技术 | 12256篇 |
出版年
2024年 | 94篇 |
2023年 | 499篇 |
2022年 | 797篇 |
2021年 | 914篇 |
2020年 | 1003篇 |
2019年 | 721篇 |
2018年 | 711篇 |
2017年 | 816篇 |
2016年 | 953篇 |
2015年 | 1144篇 |
2014年 | 1745篇 |
2013年 | 1386篇 |
2012年 | 1572篇 |
2011年 | 1332篇 |
2010年 | 835篇 |
2009年 | 765篇 |
2008年 | 860篇 |
2007年 | 909篇 |
2006年 | 680篇 |
2005年 | 627篇 |
2004年 | 489篇 |
2003年 | 421篇 |
2002年 | 315篇 |
2001年 | 273篇 |
2000年 | 185篇 |
1999年 | 161篇 |
1998年 | 112篇 |
1997年 | 90篇 |
1996年 | 78篇 |
1995年 | 55篇 |
1994年 | 58篇 |
1993年 | 30篇 |
1992年 | 35篇 |
1991年 | 20篇 |
1990年 | 19篇 |
1989年 | 14篇 |
1988年 | 15篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 2篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1972年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
41.
42.
Using the Internet, “public” computing grids can be assembled using “volunteered” PCs. To achieve this, volunteers download and install a software application capable of sensing periods of low local processor activity. During such times, this program on the local PC downloads and processes a subset of the project's data. At the completion of processing, the results are uploaded to the project and the cycle repeats. 相似文献
43.
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multi-objective optimization problems are considered as more difficult than single-objective problems. One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms. Therefore, it is possible that a single-objective problem can be solved more efficiently via a generalized multi-objective model of the problem. That this is indeed the case is proved by investigating the computation of minimum spanning trees.This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center Computational Intelligence (SFB 531) and by the German-Israeli Foundation (GIF) in the project Robustness Aspects of Algorithms. 相似文献
44.
In current desktop user interfaces, selection is usually accomplished easily with a mouse or a similar two-dimensional locator. In wearable computing, however, controlling two dimensions simultaneously gets significantly harder: a change in one dimension results easily in an undesired change in the other dimension as well when the user is occupied with a parallel task – such as walking. We present a way to overcome this problem by applying one-dimensional selection for graphical user interfaces in head-worn displays. Our new interaction technique allows a wearable computer user to perform object selection tasks easily and accurately. The technique is based on a visible circle on the screen. The user controls the circle, altering its radius with a one-dimensional valuator. The midpoint of the circle is in the middle of the screen. The object currently on the perimeter of the circle is highlighted and can be selected. Our preliminary usability evaluation, applying our custom evaluation method designed especially for walking users, indicates that the proposed technique is usable also when walking. 相似文献
45.
46.
基于质粒的DNA计算模型研究 总被引:5,自引:0,他引:5
论文给出了一种基于环状质粒DNA计算的新方法,这种计算质粒包含一个特殊的插入DNA序列片断,每个片断定位在匹配的限制性内切位点,通过剪切和粘贴实现计算过程。论文同时给出了生物计算模型和相关的数学描述,这种模式的计算有待进一步研究。 相似文献
47.
48.
Trust for Ubiquitous,Transparent Collaboration 总被引:1,自引:0,他引:1
In this paper, trust-based recommendations control the exchange of personal information between handheld computers. Combined with explicit risk analysis, this enables unobtrusive information exchange, while limiting access to confidential information. The same model can be applied to a wide range of mobile computing tasks, such as managing personal address books and electronic diaries, to automatically provide an appropriate level of security. Recommendations add structure to the information, by associating categories with data and with each other, with degrees of trust belief and disbelief. Since categories also in turn confer privileges and restrict actions, they are analogous to rôles in a Rôle-Based Access Control system, while principals represent their trust policies in recommendations. Participants first compute their trust in information, by combining their own trust assumptions with others' policies. Recommendations are thus linked together to compute a considered, local trust assessment. Actions are then moderated by a risk assessment, which weighs up costs and benefits, including the cost of the user's time, before deciding whether to allow or forbid the information exchange, or ask for help. By unifying trust assessments and access control, participants can take calculated risks to automatically yet safely share their personal information. 相似文献
49.
可编程光学二值双轨逻辑门 总被引:1,自引:0,他引:1
基于双轨逻辑,本文提出一种可级联的并行二值逻辑门。所有十六种二值逻辑运算可以采用偏振半波相延编程来实现。也提出了用电光晶体实现实时编程的方法。本文中给出了实验结果。 相似文献
50.
Stanley C. Ahalt Prakoon Chen Cheng-Taou Chou Tzyy-Ping Jung 《The Journal of supercomputing》1992,5(4):307-330
We describe an implementation of a vector quantization codebook design algorithm based on the frequencysensitive competitive learning artificial neural network. The implementation, designed for use on high-performance computers, employs both multitasking and vectorization techniques. A C version of the algorithm tested on a CRAY Y-MP8/864 is discussed. We show how the implementation can be used to perform vector quantization, and demonstrate its use in compressing digital video image data. Two images are used, with various size codebooks, to test the performance of the implementation. The results show that the supercomputer techniques employed have significantly decreased the total execution time without affecting vector quantization performance.This work was supported by a Cray University Research Award and by NASA Lewis research grant number NAG3-1164. 相似文献